A Low-Complexity Energy-Minimization-Based SCMA Detector and Its Convergence Analysis
نویسندگان
چکیده
منابع مشابه
A low complexity detector for downlink SCMA systems
Sparse Code Multiple Access (SCMA) is a novel non-orthogonal multiple access scheme for 5G systems, in which the logarithm domain message passing algorithm (Log-MPA) is applied at the receiver to achieve near-optimum performance. However, the computational complexity of Log-MPA detector is still a big challenge for practical implementation, especially for energysensitive user equipments in the ...
متن کاملA Low Complexity Detection Algorithm for SCMA
Sparse code multiple access (SCMA) is a new multiple access technique which supports massive connectivity. Compared with the current Long Term Evolution (LTE) system, it enables the overloading of active users on limited orthogonal resources and thus meets the requirement of the fifth generation (5G) wireless networks. However, the computation complexity of existing detection algorithms increas...
متن کاملLow Complexity Methods For Discretizing Manifolds Via Riesz Energy Minimization
Let A be a compact d-rectifiable set embedded in Euclidean space R, d ≤ p. For a given continuous distribution σ(x) with respect to d-dimensional Hausdorff measure on A, our earlier results provided a method for generating N -point configurations on A that have asymptotic distribution σ(x) as N →∞; moreover such configurations are “quasi-uniform” in the sense that the ratio of the covering radi...
متن کاملConvergence and Density Evolution of a Low-Complexity MIMO Detector based on Forward-Backward Recursion over a Ring
Convergence and density evolution of a low complexity, iterative MIMO detection based on belief propagation (BP) over a ring-type pair-wise graph are presented in this paper. The detection algorithm to be considered is effectively a forwardbackward recursion and was originally proposed in [13], where the link level performance and the convergence for Gaussian input were analyzed. Presented here...
متن کاملConvergence analysis of truncated incomplete Hessian Newton minimization method and application in biomolecular potential energy minimization
This paper gives a general convergence analysis to the truncated incomplete Hessian Newton method (T-IHN). It shows that T-IHN is globally convergent even with an indefinite incomplete Hessian matrix or an indefinite preconditioner, which may happen in practice. It also proves that when the T-IHN iterates are close enough to a minimum point, T-IHN has a Q-linear rate of convergence, and an admi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Vehicular Technology
سال: 2018
ISSN: 0018-9545,1939-9359
DOI: 10.1109/tvt.2018.2876121